Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines
نویسندگان
چکیده
Firing Squad Synchronisation on Cellular Automata is the dynamical synchronisation of finitely many cells without any prior knowledge their range. This can be conceived as a signal with an infinite speed. Most proposed constructions naturally translate to continuous setting machines and generate fractal figures accumulation horizontal line, i.e. synchronously, in space-time diagram. Signal are studied series articles named Abstract Geometrical Computation. In present article, we design machine that able synchronise/accumulate non-infinite slope. The slope encoded initial configuration. done by constructing tree such each node computes way expands. interest computation do away constraint discrete space, while tackling new difficulties from space. this paper particular provide basic tools for further study computable lines model.
منابع مشابه
Abstract geometrical computation 4: Small Turing universal signal machines
geometrical computation 4: small Turing universal signal machines
متن کاملAbstract Geometrical Computation 8: Small Machines, Accumulations and Rationality
Geometrical Computation 8: Small Machines, Accumulations & Rationality∗ Florent Becker Mathieu Chapelle Jérôme Durand-Lose1† Vincent Levorato Maxime Senot 1 Univ. Orléans, ENSI de Bourges, LIFO ÉA 4022, F-45067 Orléans, France 2 CESI-IRISE, 959 rue de la Bergeresse, F-45160 Olivet, France
متن کاملSignal Machine And Cellular Automaton Time-Optimal Quasi-Solutions Of The Firing Squad/Mob Synchronisation Problem On Connected Graphs
We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly bounded by a constant. It is only a quasi-solution because its number of states depends on the graph or, from another perspective, does not depend on the graph but is countably infinite. To construct this quasi-solution we in...
متن کاملAbstract Geometrical Computation for Black Hole Computation
geometrical computation for Black hole computation
متن کاملA Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem
Firing Squad Synchronization Problems are well known to be solvable by voluminous transition tables describing signals traveling and colliding. In this paper, we show that it is possible to solve it by expressing directly the fact that we want a recursive division of the space into two parts of equal size, and a notification when no further division is possible. Using fields – objects associati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.06.009